首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10947篇
  免费   1492篇
  国内免费   1160篇
工业技术   13599篇
  2024年   10篇
  2023年   64篇
  2022年   119篇
  2021年   139篇
  2020年   169篇
  2019年   141篇
  2018年   176篇
  2017年   249篇
  2016年   282篇
  2015年   410篇
  2014年   701篇
  2013年   668篇
  2012年   958篇
  2011年   1024篇
  2010年   885篇
  2009年   850篇
  2008年   974篇
  2007年   1183篇
  2006年   872篇
  2005年   867篇
  2004年   681篇
  2003年   604篇
  2002年   437篇
  2001年   316篇
  2000年   227篇
  1999年   165篇
  1998年   99篇
  1997年   75篇
  1996年   59篇
  1995年   62篇
  1994年   34篇
  1993年   32篇
  1992年   25篇
  1991年   10篇
  1990年   8篇
  1989年   6篇
  1988年   3篇
  1987年   2篇
  1986年   2篇
  1985年   3篇
  1984年   2篇
  1983年   2篇
  1982年   3篇
  1981年   1篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
郭庆  顾学迈 《通信学报》1996,17(6):90-93
本文描述并分析了一种适用于多信道VSAT卫星数据通信网的报文传输协议,特别是考虑了无线信道误码率对传输协议的影响,分析表明利用S-RE-ALOHA作为预订信道的多址方式及按报文占用数据信道方法可以减小报文传输延时并增加系统吞吐量。  相似文献   
62.
程雨  张春 《数字通信》1998,25(3):6-8,51
概述了设计话带MODEM时所要考虑的基本问题。介绍了一种用通用DSP设计的MODEM,并讨论了相应的控制程序和调制,解调程序的设计方法和结构框图,而且设计了一个简单实用的握手协议。最后,进一步分析了这种MODEM的特点和它的应用前景。  相似文献   
63.
Summary This paper proposes a self-stabilizing protocol which circulates a token on a connected network in nondeterministic depth-first-search order, rooted at a special node. Starting with any initial state in which the network may have no token at all or more than one token, the protocol eventually makes the system stabilize in states having exactly one circulating token. With a slight modification to the protocol —by removing nondeterminism in the search — a depth-first-search tree on the network can be constructed. The proposed protocol runs on systems that allow parallel operations. Shing-Tsaan Huang was born in Taiwan on September 4, 1949. He got his Ph.D. degree in 1985 from Department of Computer Science, University of Maryland at College Park. Before he pursued his Ph.D. degree, he had worked several years in the computer industry in Taiwan. Professor Huang is currently the chairman of the Department of Computer Science, Tsing Hua University, Taiwan, Republic of China. His research interests include interconnection networks, operating systems and distributed computing. He is a senior member of the IEEE Computer Society and a member of the Association for Computing Machinery. Nian-Shing Chen was born in Taiwan on October 21, 1961. He received his Ph.D. degree in computer science from National Tsing Hua University in 1990. Dr. Chen is currently an associate professor with the Department of Information Management at Sun Yat-Sen University of Taiwan. His research interests include distributed systems, computer networks, computer viruses and expert systems. He is a member of IEEE and Phi Tau Phi honorary society.This research is supported by National Science Council of the Republic of China under the contract NSC81-0408-E-007-05 and NSC82-0408-E-007-027  相似文献   
64.
In a complex social, political, economic, technological, and/or environmental context, corporate, military, government, and other organizations are often faced with collective decision-making situations. The rationale for group decision exercises is that the judgment of many will usually prove superior to the judgment of one. However, it has been shown that collective decision exercises are often highly dependent on matters of perspective, values and opinion, all of which - being essentially subjective in nature - are beyond the reach of existing formal decision technology. Furthermore, it can be expected that many collective decision exercises - particularly those of strategic import - will not lend themselves to the quantitative analysis instruments that have long dominated the management and decision science repertoire. This does not, however, mean that they must remain entirely and forever outside the bounds of scientific rationality. The ordering protocols which are currently available do not have enough technical mechanics to be relied upon to bring us to any satisfying resolution of a priori disputation. Hence, we propose an a priori ordering reference model that might support consensus-building in a multiple stakeholders context. In order to detect whether the subjective arguments are products of proper reasons or merely instances of raw rhetoric and to suggest how any logical or syntactical flaws might best be repaired, we propose logical ordering facilities and protocols for integrating procedural and instrumental provisions for a group-decision process with two lines of technical innovation: the superimpositional ordering function and the logical ordering support facilities.  相似文献   
65.
A mechanism of synchronization of components of distributed systems in which communications are based on a common time schedule for all system components is illustrated by examples of simple Time-Triggered Protocols. For parametric linear models of synchronization, the optimization problem is considered for a parameter that should exclude the overlapping of messages in communication channels. The results of using numeric methods for estimation of the optimal value of this parameter are described. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 24–32, May–June 2006.  相似文献   
66.
在无线传感器网络中,MAC协议决定着网络的信道分配,对网络的性能有很重要的影响。目前已研究出多种S-MAC协议,其中S-MAC协议是一种典型的无线传感器网络MAC协议,但此协议存在一定缺陷,无法更好地适应传感器网Jj络多变的特点。针对该问题,在S-MAC协议的基础上,结合了自适应退避窗口和根据节点队列长度预测流量的思想,提出了一种新的协议-Q-MAC协议,并达到了较为理想的预测效果。经NS2仿真验证,此协议在平均延迟、吞吐量、能量消耗方面较S-MAC协议有了显著提高。  相似文献   
67.
对Profibus-DP总线和CAN总线的协议帧结构以及数据传输方式进行了研究,提出现场总线协议转换的方法,并在此基础上进行协议转换网关的硬件和软件开发。为降低设计难度,提高系统性能,该网关采用基于ARM9内核的高性能处理器AT91RM9200作为主控芯片,并使用了专用的总线协议芯片SPC3与控制芯片SJA1000。实验结果表明,CAN总线设备可以成功接入到Profibus-DP总线中,各项性能指标都能达到设计要求,具有较高的实时性和可靠性。  相似文献   
68.
How to compose existing web services automatically and to guarantee the correctness of the design (e.g. temporal constraints specified by temporal logic LTL, CTL or CTL*) is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CTL* formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL* are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment (i.e. users or services) reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL*, respectively.  相似文献   
69.
施勇  黄宽 《物联网技术》2012,(12):50-52
提出了一种基于6LoWPAN的物联网总体方案,同时对协议中的Mesh字段进行了改进,然后在网络模拟环境下对本协议平均传输成功率、平均延迟时间的性能进行了比较分析,并在仿真环境中进行了实验验证工作。实验数据表明,改进后的协议具有更好的性能。  相似文献   
70.
越来越多的自动化设备自身配置有串行通信接口(如自动化仪表、变频器、伺服驱动器等),在工业控制现场与可编程逻辑控制(PLC)之间需要进行大量的数据传输,包括现场数据采集、设备的远程控制等。本文以欧姆龙中型CJ2系列PLC协议宏功能为例,比较以往串行通信功能,在可靠性、程序繁琐程度、调试方便性等几方面的优越性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号